runtime.evacDst.b (field)

33 uses

	runtime (current package)
		map.go#L1249: 	b *bmap          // current destination bucket
		map.go#L1265: 		x.b = (*bmap)(add(h.buckets, oldbucket*uintptr(t.BucketSize)))
		map.go#L1266: 		x.k = add(unsafe.Pointer(x.b), dataOffset)
		map.go#L1273: 			y.b = (*bmap)(add(h.buckets, (oldbucket+newbit)*uintptr(t.BucketSize)))
		map.go#L1274: 			y.k = add(unsafe.Pointer(y.b), dataOffset)
		map.go#L1328: 					dst.b = h.newoverflow(t, dst.b)
		map.go#L1330: 					dst.k = add(unsafe.Pointer(dst.b), dataOffset)
		map.go#L1333: 				dst.b.tophash[dst.i&(abi.MapBucketCount-1)] = top // mask dst.i as an optimization, to avoid a bounds check
		map_fast32.go#L413: 		x.b = (*bmap)(add(h.buckets, oldbucket*uintptr(t.BucketSize)))
		map_fast32.go#L414: 		x.k = add(unsafe.Pointer(x.b), dataOffset)
		map_fast32.go#L421: 			y.b = (*bmap)(add(h.buckets, (oldbucket+newbit)*uintptr(t.BucketSize)))
		map_fast32.go#L422: 			y.k = add(unsafe.Pointer(y.b), dataOffset)
		map_fast32.go#L452: 					dst.b = h.newoverflow(t, dst.b)
		map_fast32.go#L454: 					dst.k = add(unsafe.Pointer(dst.b), dataOffset)
		map_fast32.go#L457: 				dst.b.tophash[dst.i&(abi.MapBucketCount-1)] = top // mask dst.i as an optimization, to avoid a bounds check
		map_fast64.go#L417: 		x.b = (*bmap)(add(h.buckets, oldbucket*uintptr(t.BucketSize)))
		map_fast64.go#L418: 		x.k = add(unsafe.Pointer(x.b), dataOffset)
		map_fast64.go#L425: 			y.b = (*bmap)(add(h.buckets, (oldbucket+newbit)*uintptr(t.BucketSize)))
		map_fast64.go#L426: 			y.k = add(unsafe.Pointer(y.b), dataOffset)
		map_fast64.go#L456: 					dst.b = h.newoverflow(t, dst.b)
		map_fast64.go#L458: 					dst.k = add(unsafe.Pointer(dst.b), dataOffset)
		map_fast64.go#L461: 				dst.b.tophash[dst.i&(abi.MapBucketCount-1)] = top // mask dst.i as an optimization, to avoid a bounds check
		map_faststr.go#L432: 		x.b = (*bmap)(add(h.buckets, oldbucket*uintptr(t.BucketSize)))
		map_faststr.go#L433: 		x.k = add(unsafe.Pointer(x.b), dataOffset)
		map_faststr.go#L440: 			y.b = (*bmap)(add(h.buckets, (oldbucket+newbit)*uintptr(t.BucketSize)))
		map_faststr.go#L441: 			y.k = add(unsafe.Pointer(y.b), dataOffset)
		map_faststr.go#L471: 					dst.b = h.newoverflow(t, dst.b)
		map_faststr.go#L473: 					dst.k = add(unsafe.Pointer(dst.b), dataOffset)
		map_faststr.go#L476: 				dst.b.tophash[dst.i&(abi.MapBucketCount-1)] = top // mask dst.i as an optimization, to avoid a bounds check